Some Results on Invertible Cellular Automata
نویسندگان
چکیده
A bst ract . V-Ie address certain questions concern ing invert ible cellular aut omata (ICA) , and present new results in this area . Specifically, we explicitly const ru ct a cellular automaton (CA) in a class (r esidual clas s) previously known not to be empty only via a nonconstr uctive existe nce proof. T his class contains CAs that are invert ible on every fini te suppor t but not on an infinite la t t ice. Moreover , we show a class th at contains ICAs having bound ed neighb orh ood , but whose inverses const it ute a class of CAs for which there is no recur sive fun ct ion bo unding all t he neighborhoods.
منابع مشابه
How to Simulate Turing Machines by Invertible One-Dimensional Cellular Automata
The issue of testing invertibility of cellular automata has been often discussed. Constructing invertible automata is very useful for simulating invertible dynamical systems, based on local rules. The computation universality of cellular automata has long been positively resolved, and by showing that any cellular automaton could be simulated by an invertible one having a superior dimension, Tof...
متن کاملSome Ergodic Properties of Invertible Cellular Automata
In this paper we consider invertible one-dimensional linear cellular automata (CA hereafter) defined on a finite alphabet of cardinality p, i.e. the maps Tf [l,r] : Z Z pk → Z pk which are given by Tf [l,r](x) = (yn) ∞ n=−∞, yn = f(xn+l, . . . , xn+r) = r
متن کاملA NEW SECRET SHARING SCHEME ADVERSARY FUZZY STRUCTURE BASED ON AUTOMATA
In this paper,we introduce a new verifiable multi-use multi-secretsharing scheme based on automata and one-way hash function. The scheme has theadversary fuzzy structure and satisfy the following properties:1) The dealer can change the participants and the adversary fuzzy structure without refreshing any participants' real-shadow. 2) The scheme is based on the inversion of weakly invertible fin...
متن کاملHYPERGROUPS AND GENERAL FUZZY AUTOMATA
In this paper, we first define the notion of a complete general fuzzyautomaton with threshold c and construct an $H_{nu}$- group, as well as commutativehypergroups, on the set of states of a complete general fuzzy automatonwith threshold c. We then define invertible general fuzzy automata, discussthe notions of “homogeneity, “separation, “thresholdness connected, “thresholdnessinner irreducible...
متن کاملPhase Space Invertible Asynchronous Cellular Automata
While for synchronous deterministic cellular automata there is an accepted definition of reversibility, the situation is less clear for asynchronous cellular automata. We first discuss a few possibilities and then investigate what we call phase space invertible asynchronous cellular automata in more detail. We will show that for each Turing machine there is such a cellular automaton simulating ...
متن کاملExpansive Invertible Onesided Cellular Automata
We study expansive invertible onesided cellular automata (i.e., expansive automorphisms of onesided full shifts) and find severe dynamical and arithmetic constraints which provide partial answers to questions raised by M. Nasu [N2]. We employ the images and bilateral dimension groups, measure multipliers, and constructive combinatorial characterizations for two classes of cellular automata.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Complex Systems
دوره 9 شماره
صفحات -
تاریخ انتشار 1995